Typed Hybrid Multimodal Logic

A First Step towards Modeling Semistructured Data in Hybrid Multimodal Logic

XML documents and, more generally, semistructured data, can be seen as labelled graphs. In this paper we set a correspondence between such graphs and the models of a language of hybrid multimodal logic. This allows us to characterize a schema for semistructured data as a formula of hybrid multimodal logic, and instances of the schema (data graphs) as models of this formula. We also investigate ...

Tableaux-Based Prover for Typed Hybrid Multimodal Logic

Some potential application domains of hybrid multimodal logic suggest typing of states and imposing type–constraints on modalities. In [7] we have investigated the logical/computational cost of such an extension with a very simple system of types and concluded that there is none: both expressivity and complexity are preserved by the extension. Rewrite rules coping with state equality and state ...

Typed Hybrid Multimodal Logi

Higher-Order Syntax and Saturation Algorithms for Hybrid Logic

We present modal logic on the basis of the simply typed lambda calculus with a system of equational deduction. Combining first-order quantification and higher-order syntax, we can maintain modal reasoning in terms of classical logic by remarkably simple means. Such an approach has been broadly uninvestigated, even though it has notable advantages, especially in the case of Hybrid Logic. We deve...

Capturing well typed references in DTDs

Surprisingly enough, there has been few investigations for typing references of semistructured data and XML documents. This paper build on a previous proposal [7] introducing simple schemas with well-typed references and showing that such schemas, called normalized ref-schemas, are expressible as formulas of Hybrid Modal Logic. The aim of the present paper is to extend normalized ref-schemas in...